The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies
نویسندگان
چکیده
We consider two-player partial-observation stochastic games on finite-state graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are ω-regular conditions specified as parity objectives. The qualitative-analysis problem given a partial-observation stochastic game and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). These qualitative-analysis problems are known to be undecidable. However in many applications the relevant question is the existence of finite-memory strategies, and the qualitative-analysis problems under finite-memory strategies was recently shown to be decidable in 2EXPTIME. We improve the complexity and show that the qualitative-analysis problems for partial-observation stochastic parity games under finite-memory strategies are EXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qual-
منابع مشابه
The value problem in stochastic games. (Le problème de la valeur dans les jeux stochastiques)
Game theory proved to be very useful in the field of verification of open reactive systems. This is due to the wide variety of games’ model that differ in the way players interact and the amount of information players have. In this thesis, we study the value problem for games where players have full knowledge on their current configuration of the game, partial knowledge, and no knowledge. In th...
متن کاملA Partial-Observation Stochastic Games: How to Win when Belief Fails
In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states. The game is played for infinitelymany rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the firs...
متن کاملGames with a Weak Adversary
We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable in general, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the secon...
متن کاملOn Fixed-Parameter Complexity of Infinite Games
We investigate and classify fixed parameter complexity of several infinite duration games, including Rabin, Streett, Muller, parity, mean payoff, and simple stochastic, using different natural parameterizations. Most known fixed parameter intractable games are PSPACEor EXP-complete classically, AW [∗] or XP-hard parametrically, and are all finite duration games. In contrast, the games we consid...
متن کاملA survey of partial-observation stochastic parity games
We consider two-player zero-sum stochastic games on graphs with ω-regular winning conditions specified as parity objectives. These games have applications in the design and control of reactive systems. We survey the complexity results for the problem of deciding the winner in such games, and in classes of interest obtained as special cases, based on the information and the power of randomizatio...
متن کامل